A Theory of Timed Automata 1
نویسندگان
چکیده
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملPerformance in Supervisory Control Theory
A supervisor is generated with Supervisory Control Theory [3], resulting in a nonblocking and minimally restrictive controller. Time is introduced time using timed automata theory. A compact data structure is used to keep track of the time information in the timed automata: Heaps of Pieces [2]. The fastest sequence of events is found, using graph search algorithms of Dijkstra and A [1]. This is...
متن کاملConcurrency theory - calculi and automata for modelling untimed and timed concurrent systems
CONCURRENCY THEORY CALCULI AN AUTOMATA FOR MODELLING UNTIMED AND TIMED CONCURRENT SYSTEMS Are you looking for ebook concurrency theory calculi an automata for modelling untimed and timed concurrent systems PDF? You will be glad to know that right now concurrency theory calculi an automata for modelling untimed and timed concurrent systems PDF is available on our online library. With our online ...
متن کاملRobust Timed Automata
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and if a robust timed automaton rejects a trajectory, then it must reject neighboring trajectories also. We show that the emptiness problem for robust timed automata is still decidable, by modifying...
متن کاملAcronym : QUASIMODO Deliverable no . : D 1 . 1 Title of Deliverable : Modelling Quantitative System Aspects
This deliverable describes the results of the QUASIMODO project on modelling quantitative system aspects. Keyword list: AADL, Arcade, architectural dependability evaluation, cost-bounded reachability, priced priced/weighted timed automata, probabilistic timed automata, probabilistic timed automata, probabilistic hybrid systems. ICT-FP7-STREP-214755 / QUASIMODO Page 2 of 12 Public
متن کاملOn The Reachability Problem for Recursive Hybrid Automata with One and Two Players
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. In support of this theory, the list of undecidable problems recently shown decidable under time-...
متن کامل